Representation of Digitized Contours in Terms of Conic Arcs and Straight-Line Segments

نویسنده

  • Antonio Albano
چکیده

One of the most interesting tasks of scene analysis is the reconstruction problem, which is the problem of finding a three-dimensional description of a scene from two or more projections. When the scene is assumed to be composed of man-made objects bounded by quadric surfaces, the reconstruction process is simplified if the border lines in each projection are given by means of straight-line segments and conic arcs. Since each projection is a digitized picture, a preprocessing stage produces a description of the boundaries in terms of point sequences. This report discusses an algorithm for converting the point-sequence description to an analytic description using conic arcs and straight-line segments.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Detection Of Rib Contours in Chest Radiographs

We have constructed a computer algorithm that finds the contours of the dorsal and ventral portions of the images of ribs in chest radiographs. The following are a few of the expected uses for the automatic detection of rib contours: 1. Rib images contribute false positives in tumor-detection algorithms. Hence> detecting the rib contours should f a c i l i t a t e removal of these lalse posltiv...

متن کامل

Curvature estimation along noisy digital contours by approximate global optimization

In this paper we introduce a new curvature estimator along digital contours, that we called Global Min-Curvature estimator (GMC). As opposed to previous curvature estimators, it considers all the possible shapes that are digitized as this contour, and selects the most probable one with a global optimization approach. The GMC estimator exploits the geometric properties of digital contours by usi...

متن کامل

Segmenting curves into elliptic arcs and straight lines

A method is described for segmenting edge data into a combination of stmight lines and elliptic am. The westage process first segments the data into straight line segments. Ellipses are then fitted to the line data. ntis is much fmter than curve fitting directly topire1 data since the lines provide a great reduction in data. Segmentation is pegormed in the paradigm suwsted by Lowe [5]. A measur...

متن کامل

Fast Polynomial Segmentation of Digitized Curves

We propose a linear-time algorithm for curve segmentation which is based on constructive polynomial fitting. This work extends previous work on constructive fitting by taking the topological properties of a digitized curve into account. The algorithm uses uniform (or L∞) fitting and it works for segments of arbitrary thickness. We illustrate the algorithm with the segmentation of contours into ...

متن کامل

Constraint-based parametric conics for CAD

Current commercial CAD systems allow constraint-based profile sketching. Algebraic constructive solvers are among the fastest algorithms for solving the resulting systems of geometric constraints. Such solvers decompose the system of nonlinear equations describing the constraints into small subsystems that correspond to simple construction steps. The repertoire of geometric elements supported b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer Graphics and Image Processing

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1974